Routing Strategies for Fault Recovery in Wide Area Packet Networks
نویسندگان
چکیده
In this paper, we present the results of a study of routing algorithms for traac restoration after a failure in a virtual circuit packet switched wide area network. Standard routing algorithms based on minimizing the steady state network delay may not be appropriate for rerouting the calls after a failure, in view of the transient congestion. Here we propose alternative routing schemes to reduce the congestion. The results of a simulation study of a 10 node network comparing the performance of the diierent routing algorithms (i.
منابع مشابه
Fault Recovery Routing in Wide Area Packet Networks
We consider the problem of routing for traac restoration after a failure in virtual circuit based packet switched wide area networks utilizing source node routing. A major factor on network performance after a failure in such networks is the transient congestion period that results from restored virtual circuits attempting to send out the backlog of packets accumulated for retransmission since ...
متن کاملRouting Strategies for Fault Recovery in Wide Area Packet Networks - Military Communications Conference, 1995. MILCOM '95, Conference Record, IEEE
Iii this paper, we present the results of a study of routing algorithms for traf ic restoration after a failure in d virtual circuit packet switched wide area network. ,Ytnndard routing algorithrns based on rniiiiinizing the steady state network delay may not be appropriate for rerouting the calls after a failure, in view of the transient congestion. Here we propose alternative routing schemes ...
متن کاملFault Recovery Routing in Wide Area
In this paper, we consider the routing problem for traac restoration after a failure in a virtual circuit packet switched wide area network. We assume source node routing of virtual circuits. A major factor on network performance after a failure is the transient congestion period that results from restored virtual circuits attempting to send out the backlog of packets accumulated for retransmis...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کامل